Conditions for Digraphs Representation of the Characteristic Polynomial
نویسندگان
چکیده
This paper presents additional conditions that are needed to create proper digraphs representation of the characteristic polynomial. Contrary to currently used methods (like canonical forms) digraphs representations allow to find a complete set of all possible realisations instead of only a few realisations. In addition, all realisations in the set are minimal. Proposed additional conditions on creating digraphs representations allow faster creation of representations by restricting the creations of representations that are not proper and would have to be removed in later steps of algorithm.
منابع مشابه
Research Article Nonderogatory Unicyclic Digraphs
A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. Relations between nonderogatory digraphs and their automorphism groups have appeared in the literature (see [1] and [2, Theorem 5.10]). More recently, several articles (see, e.g., [1, 3–8]) address the problem of determining when certain operations between nonderogatory digraphs are again nonderogatory...
متن کاملInvariant subspace , determinant and characteristic polynomials ∗
Making use of an elementary fact on invariant subspace and determinant of a linear map and the method of algebraic identities, we obtain a factorization formula for a general characteristic polynomial of a matrix. This answers a question posed in [A. Deng, I. Sato, Y. Wu, Characteristic polynomials of ramified uniform covering digraphs, European Journal of Combinatorics 28 (2007), 1099–1114]. T...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملCanonical representation for approximating solution of fuzzy polynomial equations
In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness.
متن کاملOn the nonexistence of almost Moore digraphs of diameter four
Almost Moore digraphs appear in the context of the degree/diameter problem as a class of extremal directed graphs, in the sense that their order is one less than the unattainable Moore bound M(d, k) = 1 + d + · · · + d, where d > 1 and k > 1 denote the maximum out-degree and diameter, respectively. So far, the problem of their existence has only been solved when d = 2, 3 or k = 2, 3. In this pa...
متن کامل